On the classification of binary shifts of finite commutant index.
نویسنده
چکیده
We provide a complete classification up to conjugacy of the binary shifts of finite commutant index on the hyperfinite II(1), factor. There is a natural correspondence between the conjugacy classes of these shifts and polynomials over GF(2) satisfying a certain duality condition.
منابع مشابه
On the classification of binary shifts of minimal commutant index.
We provide a complete classification up to conjugacy of the binary shifts of commutant index 2 on the hyperfinite II(1) factor. There is a natural correspondence between the conjugacy classes of these shifts and polynomials over GF(2) satisfying a certain duality condition.
متن کاملIsing vectors and automorphism groups of commutant subalgebras related to root systems
In this article we study and obtain a classification of Ising vectors in vertex operator algebras associated to binary codes and √ 2 times root lattices, where an Ising vector is a conformal vector with central charge 1/2 generating a simple Virasoro sub VOA. Then we apply our results to study certain commutant subalgebras related to root systems. We completely classify all Ising vectors in suc...
متن کاملClassification of Monogenic Ternary Semigroups
The aim of this paper is to classify all monogenic ternary semigroups, up to isomorphism. We divide them to two groups: finite and infinite. We show that every infinite monogenic ternary semigroup is isomorphic to the ternary semigroup O, the odd positive integers with ordinary addition. Then we prove that all finite monogenic ternary semigroups with the same index...
متن کاملOn Hyperfinite Ii1 Subfactors of Finite Jones Index
We consider certain conditions for abstract lattices of commuting squares, that we prove are necessary and sufficient for them to arise as lattices of higher relative commutants of hyperfinite II1 inclusions of finite Jones index. In particular, we construct a one parameter family of inclusions of hyperfinite II1 factors N ⊂ M, with trivial relative commutant (Nλ)′∩Mλ = C with the Jones index [...
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Proceedings of the National Academy of Sciences of the United States of America
دوره 96 26 شماره
صفحات -
تاریخ انتشار 1999